Subsequential filters

Subsequential Convergence Conditions

Let (un) be a sequence of real numbers and let L be any (C,1) regular limitable method. We prove that, under some assumptions, if a sequence (un) or its generator sequence (V (0) n (Δu)) generated regularly by a sequence in a class of sequences is a subsequential convergence condition for L, then for any integer m ≥ 1, the mth repeated arithmetic means of (V (0) n (Δu)), (V (m) n (Δu)), generat...

Coalgebraising Subsequential Transducers

Evidence for Classifying Metathesis Patterns as Subsequential

This paper presents a computational analysis of metathesis patterns that distinguishes three categories of metathesis that differ in their computational complexity. These categories are local metathesis, bounded long distance metathesis, and unbounded long distance metathesis. Using the formalism of finite state automata, it is established that the first two categories are subsequential, while ...

Minimizing subsequential transducers: a survey

Actively Learning Probabilistic Subsequential Transducers

In this paper we investigate learning of probabilistic subsequential transducers in an active learning environment. In our learning algorithm the learner interacts with an oracle by asking probabilistic queries on the observed data. We prove our algorithm in an identification in the limit model. We also provide experimental evidence to show the correctness and to analyze the learnability of the...